Search results for "Constraint algorithm"
showing 3 items of 3 documents
Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
1994
In this paper, we present several constraint qualifications, and we show that these conditions guarantee the nonvacuity and the boundedness of the Lagrange multiplier sets for general nondifferentiable programming problems. The relationships with various constraint qualifications are investigated.
A Lagrange Multiplier Based Domain Decomposition Method for the Solution of a Wave Problem with Discontinuous Coefficients
2008
In this paper we consider the numerical solution of a linear wave equation with discontinuous coefficients. We divide the computational domain into two subdomains and use explicit time difference scheme along with piecewise linear finite element approximations on semimatching grids. We apply boundary supported Lagrange multiplier method to match the solution on the interface between subdomains. The resulting system of linear equations of the “saddle-point” type is solved efficiently by a conjugate gradient method.
A Domain Imbedding Method with Distributed Lagrange Multipliers for Acoustic Scattering Problems
2003
The numerical computation of acoustic scattering by bounded twodimensional obstacles is considered. A domain imbedding method with Lagrange multipliers is introduced for the solution of the Helmholtz equation with a second-order absorbing boundary condition. Distributed Lagrange multipliers are used to enforce the Dirichlet boundary condition on the scatterer. The saddle-point problem arising from the conforming finite element discretization is iteratively solved by the GMRES method with a block triangular preconditioner. Numerical experiments are performed with a disc and a semi-open cavity as scatterers.